Automated and readable simplification of trigonometric expressions
نویسندگان
چکیده
Automated simplification of trigonometric expressions is an important problem that hasn’t been completely solved by current computer algebra systems. This paper presents a number of unique prescriptions for the ordering of some trigonometric transformation rules, which have been derived by observing how human experts follow their intuitive rules. We have implemented the procedure in Lisp because of its suitability for formula manipulations and rule-based reasoning systems. Consequently, it can simplify many trigonometric expressions which are even difficult to do by hand, and it achieves much better results for many hard problems than any of Maple, Mathematica, and Maxima do. keywords: Simplification of trigonometric expressions, Combination rules, Rule lists, Pattern matching, Automated reasoning, Readable proof.
منابع مشابه
Rewrite Rules and Simplification of Matrix Expressions
This paper concerns the automated simplification of expressions which involve non-commuting variables. The technology has been applied to the simplification of matrix and operator theory expressions which arise in engineering applications. The non-commutative variant of the Gröbner Basis Algorithm is used to generate rewrite rules. We will also look at the phenomenon of infinite bases and impli...
متن کاملTrigonometric simplification of a class of conservative nonlinear oscillators
This paper deals with a class of conservative nonlinear oscillators of the form ẍ(t) + f (x(t)) = 0, where f (x) is analytic. A transformation of time from t to a new time coordinate τ is defined such that periodic solutions can be expressed in the form x(τ ) = A0 + A1 cos 2τ . We refer to this process of trigonometric simplification as trigonometrification. Application is given to the stabilit...
متن کاملAutomated Simplification and Deduction for Engineering Formulas
The commutative version of the Gröbner Basis Algorithm has become one of the most powerful tools in computer algebra. The recent adaptation of the algorithm to noncommuting variables has potential applications to matrix and operator expressions. A Forth-based research system was used to implement and study applications of a noncommutative variant of the Gröbner Basis Algorithm. It has been used...
متن کاملAutomated Simplification and Deduction
The commutative version of the Gröbner Basis Algorithm has become one of the most powerful tools in computer algebra. The recent adaptation of the algorithm to noncommuting variables has potential applications to matrix and operator expressions. A Forth-based research system was used to implement and study applications of a noncommutative variant of the Gröbner Basis Algorithm. It has been used...
متن کاملAlgorithms for Trigonometric Curves (Simplification, Implicitization, Parameterization)
A trigonometric curve is a real plane curve where each coordinate is given parametri-cally by a truncated Fourier series. The trigonometric curves frequently arise in various areas of mathematics, physics, and engineering. Some trigonometric curves can be also represented implicitly by bivariate polynomial equations. In this paper, we give algorithms for (a) simplifying a given parametric repre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical and Computer Modelling
دوره 44 شماره
صفحات -
تاریخ انتشار 2006